Keyword Query Routing


 Abstract
 An innovative method of accessing connected data sources on the internet is keyword search. We propose to route keywords only relevant in order reduce substantial processing cost search queries throughout all providers. a novel for computing top-k routing plans by considering their propensity contain responses specific query. use summary links between components referencing certain concisely convey these interactions. For calculating relevance through scores at level keywords, components, element sets, along with sub graphs connecting elements, multilayer scoring system given. mostly employ two strategies while looking keywords. Both schema-based and schema-agnostic techniques are involved. On top commercial databases developed techniques. By mapping databases, also known as processed. The calculated then joined using schema-derived valid join sequences create candidate networks that represent potential answers Schema-neutral methods work directly data. In methods, structured outcomes computed examining underlying graphs. Steiner trees used related items. This seeks identify structures trees. A graph, example, path uni1 award query "Stanley Robert Award". effective exploration results over graphs—which may be quite large—a variety have been developed. Bidirectional dynamic programming examples.